Revisiting Some Duality Theorems via the Quasirelative Interior in Convex Optimization
نویسنده
چکیده
In this paper we deal with regularity conditions, formulated by making use of the quasirelative interior and/or of the quasi interior of the sets involved, which guarantee strong duality for a convex optimization problem with cone (and equality) constraints and its Lagrange dual. We discuss also some results recently on this topic, which are proved to have either superfluous or contradictory assumptions. Several examples illustrate the theoretical considerations.
منابع مشابه
Regularity Conditions via Quasi-Relative Interior in Convex Programming
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, respectively. We provide also an example of a convex optimization problem for which the classical generalized interior-point conditions given so far in the literature cannot be applied, while the one given by us is ap...
متن کاملRegularity conditions via generalized interiority notions in convex optimization: new achievements and their relation to some classical statements
For the existence of strong duality in convex optimization regularity conditions play an indisputable role. We mainly deal in this paper with regularity conditions formulated by means of different generalizations of the notion of interior of a set. The primal-dual pair we investigate is a general one expressed in the language of a perturbation function and by employing its Fenchel-Moreau conjug...
متن کاملA comparison of some recent regularity conditions for Fenchel duality
This article provides an overview on regularity conditions for Fenchel duality in convex optimization. Our attention is focused, on the one hand, on three generalized interior-point regularity conditions expressed by means of the quasi interior and of the quasi-relative interior and, on the other hand, on two closednesstype conditions that have been recently introduced in the literature. We dis...
متن کاملSurrogate duality for robust optimization
Robust optimization problems, which have uncertain data, are considered. We prove surrogate duality theorems for robust quasiconvex optimization problems and surrogate min-max duality theorems for robust convex optimization problems. We give necessary and sufficient constraint qualifications for surrogate duality and surrogate min-max duality, and show some examples at which such duality result...
متن کاملAn Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008